Optimization under non-linear constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Programming Optimization for Video Coding under Multiple Constraints

This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear and convex rate-distortion functions, LP is used to generate optimal solutions for the minmax problem under VBR buffer constraints. The LP solution for this problem avoids an explicit search for the minimum distortion va...

متن کامل

Optimization Problems Under One-sided (max,min)-Linear Equality Constraints

In this article we will consider optimization problems, the objective function of which is equal to the maximum of a finite number of continuous functions of one variable. The set of feasible solutions is described by the system of (max,min)-linear equality constraints with variables on one side. Complexity of the proposed method with monotone or unimodal functions will be studied, possible gen...

متن کامل

Online Linear Optimization for Job Scheduling Under Precedence Constraints

We consider an online job scheduling problem on a single machine with precedence constraints under uncertainty. In this problem, for each trial t = 1, . . . , T , the player chooses a total order (permutation) of n fixed jobs satisfying some prefixed precedence constraints. Then, the adversary determines the processing time for each job, 9 and the player incurs as loss the sum of the processing...

متن کامل

Scheduling under Linear Constraints

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and...

متن کامل

Investment optimization under constraints

We analyze general stochastic optimization financial problems under constraints in a general framework, which includes financial models with some “imperfection”, such as constrained portfolios, labor income, random endowment and large investor models. By using general optional decomposition under constraints in a multiplicative form, we first develop a dual formulation under minimal assumption ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Economics Letters

سال: 1983

ISSN: 0165-1765

DOI: 10.1016/0165-1765(83)90027-7